Variations of R-Tree Structure for Indexing of Spatial Objects
نویسنده
چکیده
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial objects and composite optimization criteria are proposed. The efficient algorithms, including one for spatial join operation, providing for optimize considered methods are described. The results of experimental measurements of different variations of R-trees and proposed methods are presented and compared.
منابع مشابه
R-trees Have Grown Everywhere
Spatial data management has been an active area of intensive research for more than two decades. In order to support spatial objects in a database system several issues should be taken into consideration such as: spatial data models, indexing mechanisms, efficient query processing, cost models. One of the most influential access methods in the area is the R-tree structure proposed by Guttman in...
متن کاملResearch on the Distributed Parallel Spatial Indexing Schema Based on R-tree
As one of the key technologies for improving the efficiency of parallel processing of a huge volume spatial data under the distributed parallel computing environment, the parallel spatial indexing mechanism is discussed in this paper. On the viewpoint of the existing research results, the classical R-tree indexing structure and its variations have the well characteristic for parallel organizing...
متن کاملSpatial Lesion Indexing for Medical Image Databases Using Force Histograms
It is often diÆcult to come up with a well-principled approach to the selection of a spatial indexing mechanism for medical image databases. Spatial information about lesions in medical images is critically important in disease diagnosis and plays an important role in image retrieval. Unfortunately, the images are rarely indexed properly for clinically useful retrieval. One example is the well-...
متن کاملDesign and Implementation of Multi-scale Databases1
The need to access spatial data at multiple levels of detail is a fundamental requirement of many applications of geographical information, yet conventional spatial database access methods are based on single resolution spatial objects. In this paper we present a design for multi-scale spatial objects in which both spatial objects and the vertices of their component geometry are labelled with s...
متن کاملEfficient Update Method for Indexing Locations of Moving Objects
Tracking the changing positions of moving objects is becoming increasingly feasible and necessary. However, traditional spatial index structures are not suitable for storing these positions because of numerous update operations. In this paper, we propose an efficient update method for indexing the locations of moving objects based on the R-tree. This technique updates the structure of the index...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994